33 research outputs found

    The Dynamical Functional Particle Method for Multi-Term Linear Matrix Equations

    Get PDF
    Recent years have seen a renewal of interest in multi-term linear matrix equations, as these have come to play a role in a number of important applications. Here, we consider the solution of such equations by means of the dynamical functional particle method, an iterative technique that relies on the numerical integration of a damped second order dynamical system. We develop a new algorithm for the solution of a large class of these equations, a class that includes, among others, all linear matrix equations with Hermitian positive definite or negative definite coefficients. In numerical experiments, our MATLAB implementation outperforms existing methods for the solution of multi-term Sylvester equations. For the Sylvester equation AX + XB = C, in particular, it can be faster and more accurate than the built-in implementation of the Bartels–Stewart algorithm, when A and B are well conditioned and have very different size

    Algorithms for overdetermined systems of equations

    No full text
    ix, [1] s., s. 1-7: sammanfattning, s. 8-142: 6 uppsatserdigitalisering@um

    A numerical damped oscillator approach to constrained Schrödinger equations

    No full text
    This article explains and illustrates the use of a set of coupled dynamical equations, second order in a fictitious time, which converges to solutions of stationary Schrödinger equations with additional constraints. In fact, the method is general and can solve constrained minimization problems in many fields. We present the method for introductory applications in quantum mechanics including three qualitative different numerical examples: the radial Schrödinger equation for the hydrogen atom; the 2D harmonic oscillator with degenerate excited states; and a nonlinear Schrödinger equation for rotating states. The presented method is intuitive, with analogies in classical mechanics for damped oscillators, and easy to implement, either with coding or with software for dynamical systems. Hence, we find it suitable to introduce it in a continuation course in quantum mechanics or generally in applied mathematics courses which contain computational parts. The undergraduate student can, for example, use our derived results and the code (supplemental material (https://stacks.iop.org/EJP/41/065406/mmedia)) to study the Schrödinger equation in 1D for any potential. The graduate student and the general physicist can work from our three examples to derive their own results for other models including other global constraints

    Local Results for the Gauss-Newton Method on Constrained Rank-Deficient Nonlinear Least Squares

    No full text
    A nonlinear least squares problem with nonlinear constraints may be ill posed or even rank-deficient in two ways. Considering the problem formulated as min x 1=2kf 2 (x)k 2 2 subject to the constraints f 1 (x) = 0, the Jacobian J 1 = @f 1 =@x and/or the Jacobian J = @f=@x, f = [f 1 ; f 2 ], may be ill conditioned at the solution. We analyze the important special case when J 1 and/or J do not have full rank at the solution. In order to solve such a problem we formulate a nonlinear least norm problem. Next we describe a truncated Gauss-Newton method. We show that the local convergence rate is determined by the maximum of three independent Rayleigh quotients related to three different spaces in R n . Another way of solving an ill posed nonlinear least squares problem is to regularize the problem with some parameter that is reduced as the iterates converge to the minimum. Our approach is a Tikhonov based local linear regularization that converges to a minimum norm problem. This approac..

    Least Squares Approach to Inverse Problems in Musculoskeletal Biomechanics

    No full text
    Inverse simulations of musculoskeletal models computes the internal forces such as muscle and joint reaction forces, which are hard to measure, using the more easily measured motion and external forces as input data. Because of the difficulties of measuring muscle forces and joint reactions, simulations are hard to validate. One way of reducing errors for the simulations is to ensure that the mathematical problem is well-posed. This paper presents a study of regularity aspects for an inverse simulation method, often called forward dynamics or dynamical optimization, that takes into account both measurement errors and muscle dynamics. The simulation method is explained in detail. Regularity is examined for a test problem around the optimum using the approximated quadratic problem. The results shows improved rank by including a regularization term in the objective that handles the mechanical over-determinancy. Using the 3-element Hill muscle model the chosen regularization term is the norm of the activation. To make the problem full-rank only the excitation bounds should be included in the constraints. However, this results in small negative values of the activation which indicates that muscles are pushing and not pulling. Despite this unrealistic behavior the error maybe small enough to be accepted for specific applications. These results is a starting point start for achieving better results of inverse musculoskeletal simulations from a numerical point of view
    corecore